On randomizing two derandomized greedy algorithms

نویسندگان

  • KEVIN P. COSTELLO
  • PRASAD TETALI
چکیده

We consider the performance of two classic approximation algorithms which work by scanning the input and greedily constructing a solution. We investigate whether running these algorithms on a random permutation of the input can increase their performance ratio. We obtain the following results: 1. Johnson’s approximation algorithm for MAX-SAT is one of the first approximation algorithms to be rigorously analyzed. It has been shown that the performance ratio of this algorithm is 2/3. We show that when executed on a random permutation of the variables, the performance ratio of this algorithm is improved to 2/3 + c for some c > 0. This resolves an open problem of Chen, Friesen and Zhang [3]. 2. Motivated by the above improvement, we consider the performance of the greedy algorithm for MAX-CUT whose performance ratio is 1/2. Our hope was that running the greedy algorithm on a random permutation of the vertices would result in a 1/2+ c approximation algorithm. However, it turns out that in this case the performance of the algorithm remains 1/2. This resolves an open problem of Mathieu and Schudy [9].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dependent Randomized Rounding: The Bipartite Case

We analyze the two existing algorithms to generate dependent randomized roundings for the bipartite edge weight rounding problem together with several newly proposed variants of these algorithms. For both the edge-based approach of Gandhi, Khuller, Parthasarathy, Srinivasan (FOCS 2002) and the bit-wise approach of Doerr (STACS 2006) we give a simple derandomization (guaranteeing the same roundi...

متن کامل

Randomized Rounding for Routing and Covering Problems: Experiments and Improvements

Following previous theoretical work by Srinivasan (FOCS 2001) and the first author (STACS 2006) and a first experimental evaluation on random instances (ALENEX 2009), we investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algorithmic problems, namely low-congestion routing in n...

متن کامل

Bounds on Greedy Algorithms for MAX SAT

We study adaptive priority algorithms for MAX SAT and show that no such deterministic algorithm can reach approximation ratio 3 4 , assuming an appropriate model of data items. As a consequence we obtain that the Slack–Algorithm of [13] cannot be derandomized. Moreover, we present a significantly simpler version of the Slack–Algorithm and also simplify its analysis. Additionally, we show that t...

متن کامل

Single Machine Scheduling with Release Dates

We consider the scheduling problem of minimizing the average weighted completion time of n jobs with release dates on a single machine. We first study two linear programming relaxations of the problem, one based on a time-indexed formulation, the other on a completiontime formulation. We show their equivalence by proving that a O(n logn) greedy algorithm leads to optimal solutions to both relax...

متن کامل

Derandomizing and Rerandomizing Variance Estimators

This technical report is meant to accompany the paper 7] and should be read in conjunction with that work. It describes several concepts which were alluded to in 7] but not elaborated on. We give algorithms for computing the derandomized estimator, introduce the concept of rerandom-ization, examine heuristically the question of how the derandomized and standard variance estimators behave as the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010